By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 5, Issue 2, pp. 181-331

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Multidimensional Searching Problems

David Dobkin and Richard J. Lipton

pp. 181-186

BibTeX  Abstract Full Text:  PDF

On the Additive Complexity of Matrix Multiplication

Robert L. Probert

pp. 187-203

BibTeX  Abstract Full Text:  PDF

Graph Transformations for Roundoff Analysis

Webb Miller

pp. 204-216

BibTeX  Abstract Full Text:  PDF

On Families of Languages Defined by Time-Bounded Random Access Machines

I. H. Sudborough and A. Zalcberg

pp. 217-230

BibTeX  Abstract Full Text:  PDF

Noncanonical Extensions of Bottom-Up Parsing Techniques

Thomas G. Szymanski and John H. Williams

pp. 231-250

BibTeX  Abstract Full Text:  PDF

Termination Properties of Generalized Petri Nets

Y. Edmund Lien

pp. 251-265

BibTeX  Abstract Full Text:  PDF

Algorithmic Aspects of Vertex Elimination on Graphs

Donald J. Rose, R. Endre Tarjan, and George S. Lueker

pp. 266-283

BibTeX  Abstract Full Text:  PDF

Decomposition Theorems for Various Kinds of Languages Parallel in Nature

Sven Skyum

pp. 284-296

BibTeX  Abstract Full Text:  PDF

Ranking Algorithms: The Symmetries and Colorations of the $n$-Cube

Jay P. Fillmore and S. G. Williamson

pp. 297-304

BibTeX  Abstract Full Text:  PDF

Local Adjunct Languages and Regular Sets

Leon S. Levy

pp. 305-308

BibTeX  Abstract Full Text:  PDF

Synthesizing a Response Function with a Feedback Scheduling Algorithm

Arthur Bernstein

pp. 309-317

BibTeX  Abstract Full Text:  PDF

On Preserving Proximity in Extendible Arrays

D. Bollman

pp. 318-323

BibTeX  Abstract Full Text:  PDF

Computational Complexity over Finite Fields

Volker Strassen

pp. 324-331

BibTeX  Abstract Full Text:  PDF